Method and system for resolving producer and consumer affinities in interaction servicing

ABSTRACT

A system and a method for processing a message on a processing platform, such as a Kafka processing platform, are provided. The method includes: acquiring a plurality of partitions from the messaging platform; designating a first partition from among the plurality of partitions as a sticky partition; generating a plurality of routing keys that are configured to route messages to the sticky partition; using a first routing key from among the plurality of routing keys to identify a first service subscription; subscribing to a second service using the first routing key; and receiving a message transmitted by the second service.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Patent Application Ser. No. 63/036,752, filed Jun. 9, 2020, which is hereby incorporated by reference in its entirety.

This application is being filed concurrently on Nov. ______, 2020 with each of U.S. patent application Ser. No. ______, entitled “Method and System for Interaction Servicing”; U.S. patent application Ser. No. ______, entitled “Method and System for Interaction Servicing with Embeddable Ribbon Display”; U.S. patent application Ser. No. ______, entitled “Method and System for Resolving Producer and Consumer Affinities in Interaction Servicing”; U.S. patent application Ser. No. ______, entitled “Method and System for Providing Resiliency in Interaction Servicing”; U.S. patent application Ser. No. ______, entitled “Method and System for Providing Resiliency in Interaction Servicing Across Data Centers”; U.S. patent application Ser. No. ______, entitled “Method and System for Providing Defense Mechanisms for Handling Grey Failures in Interaction Servicing”; and U.S. patent application Ser. No. ______, entitled “Method and System for Providing High Efficiency, Bidirectional Messaging for Low Latency Applications,” the contents of each of which is hereby incorporated by reference in its respective entirety.

BACKGROUND 1. Field of the Disclosure

This technology generally relates to methods and systems for performing customer service interactions, and more particularly to methods and systems for integrating and streamlining large number of customer service interactions to ensure efficient and accurate interaction servicing results.

2. Background Information

For a large corporate organization that has many customers, customer service is an important aspect of the business operation. Customers typically expect service requests to be handled in a timely and accurate manner, and if the corporate organization fails to provide such customer service, there may be a negative effect on the reputation of that organization.

Many customer service requests are performed online via the Internet. For such requests, it is important that the request be assessed and routed to the correct entity within the corporate organization, together with all of the relevant information that will be needed by the entity that will handle the request. However, the proper routing and handling of such requests may be complicated when the number of requests is large and the size of the corporate organization is large.

Accordingly, there is a need for a tool that integrates and streamlines the processing of customer service interactions in order to ensure efficient and accurate handling and resolution thereof.

SUMMARY

The present disclosure, through one or more of its various aspects, embodiments, and/or specific features or sub-components, provides, inter alia, various systems, servers, devices, methods, media, programs, and platforms for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

According to an aspect of the present disclosure, a method for servicing a plurality of interactions with users is provided. The method is implemented by at least one processor. The method includes: receiving, by the at least one processor from each respective user, a respective request for a corresponding interaction; obtaining, by the at least one processor for each interaction, request-specific information that relates to the received respective request and user-specific information that relates to the respective user; analyzing, by the at least one processor for each interaction, the request-specific information to determine at least one corresponding microservice that is usable for handling the interaction; and routing, by the at least one processor for each interaction, the request-specific information and the user-specific information to a respective destination that relates to the determined at least one corresponding microservice.

The method may further include receiving, by the at least one processor from the at least one corresponding microservice, response information that relates to a response to the respective request for the corresponding interaction.

The method may further include displaying, by the at least processor for at least one interaction, a screen that includes at least a subset of the request-specific information, at least a subset of the user-specific information, and status information that relates to a status of the response to the respective request for the at least one interaction.

The method may further include determining, for each interaction, a request type for each respective request, the request type including at least one from among a voice request, an email request, an online chat request, a browser request, and a click-to-call request.

The analyzing may further include analyzing the request-specific information to determine at least two corresponding microservices that are usable for handling the corresponding interaction.

The method may further include determining at least two separate routes having at least two different destinations that correspond to the determined at least two corresponding microservices; and using at least one metric that relates to a workload distribution to select an optimum route from among the determined at least two separate routes. The routing may further include using the selected optimum route.

According to another exemplary embodiment, a method for processing a message on a messaging platform is provided. The method is implemented by at least one processor. The method includes: acquiring, by the at least one processor, a plurality of partitions from the messaging platform; designating, by the at least one processor, a first partition from among the plurality of partitions as a sticky partition; generating, by the at least one processor, a plurality of routing keys that are configured to route messages to the sticky partition; using, by the at least one processor, a first routing key from among the plurality of routing keys for a first service subscription; processing, by the at least one processor, the first service subscription and returning the first routing key as a first subscription identifier; removing, by the at least one processor, the first routing key from the plurality of routing keys for a subsequent service subscription; and receiving, by the at least one processor, a message transmitted by a second service using the first subscription identifier as a routing key.

The messaging platform may include a Kafka messaging platform.

The method may further using a custom Kafka sticky partition assignor to acquire a first plurality of metadata that relates to sticky partition preferences; and determining, for each of the first plurality of metadata, a respective highest priority partition for which a corresponding assignment does not change.

According to yet another exemplary embodiment, a method for processing on a Kafka messaging platform is provided. The method is implemented by at least one processor. The method includes: acquiring, by the at least one processor, a first plurality of subscription requests from an external facing request topic and a second plurality of subscription requests from an internal local availability zone topic; determining, by the at least one processor for each of the first plurality of subscription requests and for each of the second plurality of subscription requests, a respective resource-identifier; and generating, by the at least one processor for each respective resource-identifier, a corresponding subscription message.

When a first subscription message from the external facing request topic is consumed, the method may further include: determining, by the at least one processor, a first resource-identifier that corresponds to the first subscription message; subscribing, by the at least one processor, to a first event source that corresponds to the first resource-identifier; transmitting, by the at least one processor, the first subscription message to at least one remote availability zone; and persisting, by the at least one processor, a primary mapping of an identification of the first resource-identifier to a request topic partition index.

When a second subscription message from the internal availability zone is consumed, the method may further include: determining, by the at least one processor, a the first resource-identifier that corresponds to the second subscription message; subscribing, by the at least one processor, to the first event source that corresponds to the first resource-identifier; and persisting, by the at least one processor, a backup mapping of the first resource-identifier to a local availability zone topic partition index.

When a first request from the external facing request topic is consumed, the method may further include processing the first request by propagating the first request to an event source at which a subscription has already been established.

When an event is received from the event source, the method may further include: determining that the event is from a primary mapping, and transmitting the corresponding subscription message to an output topic; when an equivalent message from a backup mapping has been previously cached, deleting the equivalent message from the cache; and when an equivalent message from a backup mapping has not been previously cached, caching the event with at least one detail relating to the backup mapping.

When an event is received from the event source, the method may further include: determining that the event is from a backup mapping; and transmitting the corresponding subscription message to a request topic.

When a subsequent message is received from the request topic, the method may further include: when an equivalent message from a primary mapping has been previously cached, deleting the equivalent message from the cache; and when an equivalent message from a primary mapping has not been previously cached, caching the event with at least one detail relating to the backup mapping.

According to yet another exemplary embodiment, a method for minimizing latency on a Kafka messaging platform is provided. The method is implemented by at least one processor. The method includes: receiving, by the at least one processor, a plurality of messages from a plurality of users on a single topic-partition; using, by the at least one processor, a user identifier that relates to a unique user and a corresponding routing key that is unique to a user in a first message from among the plurality of messages; determining, by the at least one processor, a first subset of the plurality of messages that are executable in parallel and a second subset of the plurality of messages that are processible sequentially in order of receipt; executing, by the at least one processor, the first subset of the plurality of messages in parallel; and processing, by the at least one processor, the second subset of the plurality of messages sequentially in order of receipt using the corresponding routing key.

When a command to execute a task with a key is received, the method may further include: acquiring a per-key-queue-map lock; obtaining an existing per-key-queue from the per-key-queue-map; adding the task to the existing per-key-queue; and releasing the per-key-queue-map lock.

When a command to execute a task with a key is received, the method may further include: acquiring a per-key-queue-map lock; determining that an existing per-key-queue does not exist; generating a new per-key-queue; adding a first task to the new per-key-queue; adding the new per-key-queue to the per-key-queue-map; releasing the per-key-queue-map lock; executing at least one task from among a plurality of tasks in the per-key-queue; and stopping execution when the per-key-queue is empty.

When a command to execute a task with a key is received, the method may further include: receiving a number of tasks to be completed in a batch of tasks; tracking a completion of each task in the batch of tasks; determining uncompleted tasks from among the batch of tasks; and when all tasks in the batch have been completed, sending a notification that the batch has been completed.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure is further described in the detailed description which follows, in reference to the noted plurality of drawings, by way of non-limiting examples of preferred embodiments of the present disclosure, in which like characters represent like elements throughout the several views of the drawings.

FIG. 1 illustrates an exemplary computer system.

FIG. 2 illustrates an exemplary diagram of a network environment.

FIG. 3 shows an exemplary system for implementing a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

FIG. 4 is a flowchart of an exemplary process for implementing a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

FIG. 5 is a first screenshot that illustrates a user interface for handling a customer interaction, according to an exemplary embodiment.

FIG. 6 is a second screenshot that illustrates customer identification information that is displayable on the user interface for handling a customer interaction, according to an exemplary embodiment.

FIG. 7 is a diagram that illustrates a plurality of microservices and corresponding routing paths for implementing a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results, according to an exemplary embodiment.

FIG. 8 is a flowchart of a method for processing a message that is implemented on a consumer side of a Kafka messaging platform, according to an exemplary embodiment.

FIG. 9 is a flowchart of a method for processing a message that is implemented on a producer side of Kafka messaging platform, according to an exemplary embodiment.

FIG. 10 is a flowchart of a method for minimizing latency while maintaining order and scale on Kafka Messaging platform, according to an exemplary embodiment.

DETAILED DESCRIPTION

Through one or more of its various aspects, embodiments and/or specific features or sub-components of the present disclosure, are intended to bring out one or more of the advantages as specifically described above and noted below.

The examples may also be embodied as one or more non-transitory computer readable media having instructions stored thereon for one or more aspects of the present technology as described and illustrated by way of the examples herein. The instructions in some examples include executable code that, when executed by one or more processors, cause the processors to carry out steps necessary to implement the methods of the examples of this technology that are described and illustrated herein.

FIG. 1 is an exemplary system for use in accordance with the embodiments described herein. The system 100 is generally shown and may include a computer system 102, which is generally indicated.

The computer system 102 may include a set of instr fictions that can be executed to cause the computer system 102 to perform any one or more of the methods or computer-based functions disclosed herein, either alone or in combination with the other described devices. The computer system 102 may operate as a standalone device or may be connected to other systems or peripheral devices. For example, the computer system 102 may include, or be included within, any one or more computers, servers, systems, communication networks or cloud environment. Even further, the instructions may be operative in such cloud-based computing environment.

In a networked deployment, the computer system 102 may operate in the capacity of a server or as a client user computer in a server-client user network environment, a client user computer in a cloud computing environment, or as a peer computer system in a peer-to-peer (or distributed) network environment. The computer system 102, or portions thereof, may be implemented as, or incorporated into, various devices, such as a personal computer, a tablet computer, a set-top box, a personal digital assistant, a mobile device, a palmtop computer, a laptop computer, a desktop computer, a communications device, a wireless smart phone, a personal trusted device, a wearable device, a global positioning satellite (GPS) device, a web appliance, a device that is running the Apple iOS operating system, a device that is running the Android operating system, a device that is capable of running a web browser to connect to the Internet, or any other machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while a single computer system 102 is illustrated, additional embodiments may include any collection of systems or sub-systems that individually or jointly execute instructions or perform functions. The term “system” shall be taken throughout the present disclosure to include any collection of systems or sub-systems that individually or jointly execute a set, or multiple sets, of instructions to perform one or more computer functions.

As illustrated in FIG. 1, the computer system 102 may include at least one processor 104. The processor 104 is tangible and non-transitory. As used herein, the term “non-transitory” is to be interpreted not as an eternal characteristic of a state, but as a characteristic of a state that will last for a period of time. The term “non-transitory” specifically disavows fleeting characteristics such as characteristics of a particular carrier wave or signal or other forms that exist only transitorily in any place at any time. The processor 104 is an article of manufacture and/or a machine component. The processor 104 is configured to execute software instructions in order to perform functions as described in the various embodiments herein. The processor 104 may be a general-purpose processor or may be part of an application specific integrated circuit (ASIC). The processor 104 may also be a microprocessor, a microcomputer, a processor chip, a controller, a microcontroller, a digital signal processor (DSP), a state machine, or a programmable logic device. The processor 104 may also be a logical circuit, including a programmable gate array (PGA) such as a field programmable gate array (FPGA), or another type of circuit that includes discrete gate and/or transistor logic. The processor 104 may be a central processing unit (CPU), a graphics processing unit (GPU), or both. Additionally, any processor described herein may include multiple processors, parallel processors, or both. Multiple processors may be included in, or coupled to, a single device or multiple devices.

The computer system 102 may also include a computer memory 106. The computer memory 106 may include a static memory, a dynamic memory, or both in communication. Memories described herein are tangible storage mediums that can store data as well as executable instructions and are non-transitory during the time instructions are stored therein. Again, as used herein, the term “non-transitory” is to be interpreted not as an eternal characteristic of a state, but as a characteristic of a state that will last for a period of time. The term “non-transitory” specifically disavows fleeting characteristics such as characteristics of a particular carrier wave or signal or other forms that exist only transitorily in any place at any time. The memories are an article of manufacture and/or machine component. Memories described herein are computer-readable mediums from which data and executable instructions can be read by a computer. Memories as described herein may be random access memory (RAM), read only memory (ROM), flash memory, electrically programmable read only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), registers, a hard disk, a cache, a removable disk, tape, compact disk read only memory (CD-ROM), digital versatile disk (DVD), floppy disk, blu-ray disk, or any other form of storage medium known in the art. Memories may be volatile or non-volatile, secure and/or encrypted, unsecure and/or unencrypted. Of course, the computer memory 106 may comprise any combination of memories or a single storage.

The computer system 102 may further include a display 108, such as a liquid crystal display (LCD), an organic light emitting diode (OLED), a flat panel display, a solid state display, a cathode ray tube (CRT), a plasm a display, or any other type of display, examples of which are well known to skilled persons.

The computer system 102 may also include at least one input device 110, such as a keyboard, a touch-sensitive input screen or pad, a speech input, a mouse, a remote control device having a wireless keypad, a microphone coupled to a speech recognition engine, a camera such as a video camera or still camera, a cursor control device, a global positioning system (GPS) device, an altimeter, a gyroscope, an accelerometer, a proximity sensor, or any combination thereof. Those skilled in the art appreciate that various embodiments of the computer system 102 may include multiple input devices 110. Moreover, those skilled in the art further appreciate that the above-listed, exemplary input devices 110 are not meant to be exhaustive and that the computer system 102 may include any additional, or alternative, input devices 110.

The computer system 102 may also include a medium reader 112 which is configured to read any one or more sets of instructions, e.g. software, from any of the memories described herein. The instructions, when executed by a processor, can be used to perform one or more of the methods and processes as described herein. In a particular embodiment, the instructions may reside completely, or at least partially, within the memory 106, the medium reader 112, and/or the processor 110 during execution by the computer system 102.

Furthermore, the computer system 102 may include any additional devices, components, parts, peripherals, hardware, software or any combination thereof which are commonly known and understood as being included with or within a computer system, such as, but not limited to, a network interface 114 and an output device 116. The output device 116 may be, but is not limited to, a speaker, an audio out, a video out, a remote-control output, a printer, or any combination thereof.

Each of the components of the computer system 102 may be interconnected and communicate via a bus 118 or other communication link. As illustrated in FIG. 1, the components may each be interconnected and communicate via an internal bus. However, those skilled in the art appreciate that any of the components may also be connected via an expansion bus. Moreover, the bus 118 may enable communication via any standard or other specification commonly known and understood such as, but not limited to, peripheral component interconnect, peripheral component interconnect express, parallel advanced technology attachment, serial advanced technology attachment, etc.

The computer system 102 may be in communication with one or more additional computer devices 120 via a network 122. The network 122 may be, but is not limited to, a local area network, a wide area network, the Internet, a telephony network, a short-range network, or any other network commonly known and understood in the art. The short-range network may include, for example, Bluetooth, Zigbee, infrared, near field communication, ultraband, or any combination thereof. Those skilled in the art appreciate that additional networks 122 which are known and understood may additionally or alternatively be used and that the exemplary networks 122 are not limiting or exhaustive. Also, while the network 122 is illustrated in FIG. 1 as a wireless network, those skilled in the art appreciate that the network 122 may also be a wired network.

The additional computer device 120 is illustrated in FIG. 1 as a personal computer. However, those skilled in the art appreciate that, in alternative embodiments of the present application, the computer device 120 may be a laptop computer, a tablet PC, a personal digital assistant, a mobile device, a palmtop computer, a desktop computer, a communications device, a wireless telephone, a personal trusted device, a web appliance, a server, a device that is running the Apple iOS operating system, a device that is running the Android operating system, a device that is capable of running a web browser to connect to the Internet, or any other device that is capable of executing a set of instructions, sequential or otherwise, that specify actions to be taken by that device. Of course, those skilled in the art appreciate that the above-listed devices are merely exemplary devices and that the device 120 may be any additional device or apparatus commonly known and understood in the art without departing from the scope of the present application. For example, the computer device 120 may be the same or similar to the computer system 102. Furthermore, those skilled in the art similarly understand that the device may be any combination of devices and apparatuses.

Of course, those skilled in the art appreciate that the above-listed components of the computer system 102 are merely meant to be exemplary and are not intended to be exhaustive and/or inclusive. Furthermore, the examples of the components listed above are also meant to be exemplary and similarly are not meant to be exhaustive and/or inclusive.

In accordance with various embodiments of the present disclosure, the methods described herein may be implemented using a hardware computer system that executes software programs. Further, in an exemplary, non-limited embodiment, implementations can include distributed processing, component/object distributed processing, and parallel processing. Virtual computer system processing can be constructed to implement one or more of the methods or functionalities as described herein, and a processor described herein may be used to support a virtual processing environment.

As described herein, various embodiments provide optimized methods and systems for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

Referring to FIG. 2, a schematic of an exemplary network environment 200 for implementing a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results is illustrated. In an exemplary embodiment, the method is executable on any networked computer platform, such as, for example, a personal computer (PC), a device that is running the Apple iOS operating system, a device that is running the Android operating system, or a device that is capable of running a web browser to connect to the Internet.

The method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results may be implemented by an Interaction Servicing Fabric (ISF) device 202. The ISF device 202 may be the same or similar to the computer system 102 as described with respect to FIG. 1. The ISF device 202 may store one or more applications that can include executable instructions that, when executed by the ISF device 202, cause the ISF device 202 to perform actions, such as to transmit, receive, or otherwise process network messages, for example, and to perform other actions described and illustrated below with reference to the figures. The application(s) may be implemented as modules or components of other applications. Further, the application(s) can be implemented as operating system extensions, modules, plugins, or the like.

Even further, the application(s) may be operative in a cloud-based computing environment. The application(s) may be executed within or as virtual machine(s) or virtual server(s) that may be managed in a cloud-based computing environment. Also, the application(s), and even the ISF device 202 itself, may be located in virtual server(s) running in a cloud-based computing environment rather than being tied to one or more specific physical network computing devices. Also, the application(s) may be running in one or more virtual machines (VMs) executing on the ISF device 202. Additionally, in one or more embodiments of this technology, virtual machine(s) running on the IST device 202 may be managed or supervised by a hypervisor.

In the network environment 200 of FIG. 2, the ISF device 202 is coupled to a plurality of server devices 204(1)-204(n) that hosts a plurality of databases 206(1)-206(n), and also to a plurality of client devices 208(1)-208(n) via communication network(s) 210. A communication interface of the ISF device 202, such as the network interface 114 of the computer system 102 of FIG. 1, operatively couples and communicates between the ISF device 202, the server devices 204(1)-204(n), and/or the client devices 208(1)-208(n), which are all coupled together by the communication network(s) 210, although other types and/or numbers of communication networks or systems with other types and/or numbers of connections and/or configurations to other devices and/or elements may also be used.

The communication network(s) 210 may be the same or similar to the network 122 as described with respect to FIG. 1, although the ISF device 202. the server devices 204(1)-204(n), and/or the client devices 208(1)-208(n) may be coupled together via other topologies. Additionally, the nets network environment 200 may include other network devices such as one or more routers and/or switches, for example, which are well known in the art and thus will not be described herein. This technology provides a number of advantages including methods, non-transitory computer readable media, and ISF devices that efficiently implement methods and systems for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

By way of example only, the communication network(s) 210 may include local area network(s) (LAN(s)) or wide area networks) (WAN(s)), and can use TCP/IP over Ethernet and industry-standard protocols, although other types and/or numbers of protocols and/or communication networks may be used. The communication network(s) 210 in this example may employ any suitable interface mechanisms and network communication technologies including, for example, teletraffic in any suitable form (e.g., voice, modem, and the like), Public Switched Telephone Network (PSTNs), Ethernet-based Packet Data Networks (PDNs), combinations thereof, and the like.

The ISF device 202 may be a standalone device or integrated with one or more other devices or apparatuses, such as one or more of the server devices 204(1)-204(n), for example. In one particular example, the ISF device 202 may include or be hosted by one of the server devices 204(1)-204(n), and other arrangements are also possible. Moreover, one or more of the devices of the ISF device 202 may be in a same or a different communication network including one or more public, private, or cloud networks, for example.

The plurality of server devices 204(1)-204(n) may be the same or similar to the computer system 102 or the computer device 120 as described with respect to FIG. 1, including any features or combination of features described with respect thereto. For example, any of the server devices 204(1)-204(n) may include, among other features, one or more processors, a memory, and a communication interface, which are coupled together by a bus or other communication link, although other numbers and/or types of network devices may be used. The server devices 204(1)-204(n) in this example may process requests received from the ISF device 202 via the communication network(s) 210 according to the HTTP-based and/or JavaScript Object Notation (JSON) protocol, for example, although other protocols may also be used.

The server devices 204(1)-204(n) may be hardware or software or may represent a system with multiple servers in a pool, which may include internal or external networks. An Availability Zone is considered equivalent to a pool. The server devices 204(1)-204(n) hosts the databases 206(1)-206(n) that are configured to store data that relates to user requests, identification information that relates to individual users, and microservices that are used for resolving user requests.

Although the server devices 204(1)-204(n) are illustrated as single devices, one or more actions of each of the server devices 204(1)-204(n) may be distributed across one or more distinct network computing devices that together comprise one or more of the server devices 204(1)-204(n). Moreover, the server devices 204(1)-204(n) are not limited to a particular configuration. Thus, the server devices 204(1)-204(n) may contain a plurality of network computing devices that operate using a master/slave approach, whereby one of the network computing devices of the server devices 204(1)-204(n) operates to manage and/or otherwise coordinate operations of the other network computing devices.

The server devices 204(1)-204(n) may operate as a plurality of network computing devices within a duster architecture, a peer-to peer architecture, virtual machines, or within a cloud architecture, for example. Thus, the technology disclosed herein is not to be construed as being limited to a single environment and other configurations and architectures are also envisaged.

The plurality of client devices 208(1)-208(n) may also be the same or similar to the computer system 102 or the computer device 120 as described with respect to FIG. 1, including any features or combination of features described with respect thereto. For example, the client devices 208(1)-208(n) in this example may include any type of computing device that can interact with the INF device 202 via communication network(s) 210. Accordingly, the client devices 208(1)-208(n) may be mobile computing devices, desktop computing devices, laptop computing devices, tablet computing devices, virtual machines (including cloud-based computers), or the like, that host chat, e-mail, or voice-to-text applications, for example. In an exemplary embodiment, at least one client device 208 is a wireless mobile communication device, a smart phone.

The client devices 208(1)-208(n) may run interface applications, such as standard web browsers or standalone client applications, which may provide an interface to communicate with the ISF device 202 via the communication network(s) 210 in order to communicate user requests and information. The client devices 208(1)-208(n) may further include, among other features, a display device, such as a display screen or touchscreen, and/or an input device, such as a keyboard, for example.

Although the exemplary network environment 200 with the ISF device 202, the server devices 204(1)-204(n), the client devices 208(1)-208(n), and the communication network(s) 210 are described and illustrated herein, other types and/or numbers of systems, devices, components, and/or elements in other topologies may be used. It is to be understood that the systems of the examples described herein are for exemplary purposes, as many variations of the specific hardware and software used to implement the examples are possible, as will be appreciated by those skilled in the relevant art(s).

One or more of the devices depicted in the network environment 200, such as the ISF device 202, the server devices 204(1)-204(n), or the client devices 208(1)-208(n), for example, may be configured to operate as virtual instances on the same physical machine. In other words, one or more of the ISF device 202, the server devices 204(1)-204(n), or the client devices 208(1)-208(n) may operate on the same physical device rather than as separate devices communicating through communication network(s) 210. Additionally, there may be more or fewer ISF devices 202, server devices 204(1)-204(n), or client devices 208(1)-208(n) than illustrated in FIG. 2.

In addition, two or more computing systems or devices may be substituted for any one of the systems or devices in any example. Accordingly, principles and advantages of distributed processing, such as redundancy and replication also may be implemented, as desired, to increase the robustness and performance of the devices and. systems of the examples. The examples may also be implemented on computer system(s) that extend across any suitable network using any suitable interface mechanisms and traffic technologies, including by way of example only teletraffic in any suitable form (e.g., voice and modern), wireless traffic networks, cellular traffic networks, Packet Data Networks (PDNs), the Internet, intranets, and combinations thereof.

The ISF device 202 is described and illustrated in FIG. 3 as including an interaction services routing and handling module 302, although it may include other rules, policies, modules, databases, or applications, for example. As will be described below, the interaction services routing and handling module 302 is configured to implement a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

An exemplary process 300 for implementing a mechanism for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results by utilizing the network environment of FIG. 2 is illustrated as being executed in FIG. 3. Specifically, a first client device 208(1) and a second client device 208(2) are illustrated as being in communication with ISF device 202. In this regard, the first client device 208(1) and the second client device 208(2) may be “clients” of the ISF device 202 and are described herein as such. Nevertheless, it is to be known and understood that the first client device 208(1) and/or the second client device 208(2) need not necessarily be “clients” of the ISF device 202, or any entity described in association therewith herein.

Any additional or alternative relationship may exist between either or both of the first client device 208(1) and the second client device 208(2) and the ISF device 202, or no relationship may exist. For example, the ISF device 202 and the first client device 208(1) may be configured as the same physical device.

Further, ISF device 202 is illustrated as being able to access a microservices data repository 206(1) and a user-specific identification information database 206(2). The interaction services routing and handling module 302 may be configured to access these databases for implementing a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results.

The first client device 208(1) may be, for example, a smart phone. Of course, the first client device 208(1) may be any additional device described herein. The second client device 208(2) may be, for example, a personal computer (PC). Of course, the second client device 208(2) may also be any additional device described herein.

The process may be executed via the communication network(s) 210, which may comprise plural networks as described above. For example, in an exemplary embodiment, either or both of the first client device 208(1) and the second client device 208(2) may communicate with the ISF device 202 via broadband or cellular communication. Alternatively, the process may be executed by the ISF device 202 in a standalone manner, e.g., by a smart phone on which the interaction services routing and handling module 302 has been downloaded. Of course, these embodiments are merely exemplary and are not limiting or exhaustive.

Upon being started, a processor that is hosted in the ISF device 202 executes a process for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results. An exemplary process for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results is generally indicated at flowchart 400 in FIG. 4.

In process 400 of FIG. 4, at step S402, the interaction services routing and handling module 302 receives, from each of a plurality of users, a respective request for a corresponding interaction. At step S404, the interaction services routing and handling module 302 obtains request-specific information that relates to each respective request and user-specific information that relates to each respective user. In an exemplary embodiment, the interaction services routing and handling module 302 prompts each user to enter the user-specific information via a graphical user interface that is displayed on the screen of a client device 208.

Further, the interaction services routing and handling module 302 may also display, on a screen of the IDF device 202, a user interface for handling an interaction request that includes at least a subset of the request-specific information and at least a subset of the user-specific information. For example, referring to FIG. 5, a first screenshot 500 that illustrates a user interface for handling a customer interaction may include a task bar at the top of the screen, a trapezoidal-shaped ribbon that includes request-specific information and user-specific information at the top right-hand portion of the screen, a menu and a list of recent interactions along the left side of the screen, and status information relating to the current interaction request in the body of the screen. As another example, referring to FIG. 6, a second screenshot 600 that illustrates the user interface may include more details of the user-specific information, together with the trapezoidal-shaped ribbon shown in FIG. 5.

At step S406, the interaction services routing and handling module 302 determines, for each interaction, a request type for each respective request. The request type may indicate a communication mode by which a particular request is received. In an exemplary embodiment, the request type may include at least one of a voice request, an email request, an online chat request, a browser request, and a click-to-call request.

At step S408, the interaction services routing and handling module 302. analyzes, for each requested interaction, the request-specific information in order to determine at least one corresponding microservice and/or at least one microservice instance that is usable for handling the interaction. In an exemplary embodiment, the interaction services routing and handling module may determine more than one such microservice. For example, there may be any number of microservices that are suitable for handling different aspects of an interaction, such as two (2), three (3), five (5), ten (10), twenty (20), fifty (50), one hundred (100), or more such microservices; and some of these may have overlapping functions. As another example, there may be multiple microservice instances, which refers to using one particular microservice multiple times.

At step S410, the interaction services routing and handling module 302 determines at least one suitable route for transmitting the request-specific information and the user-specific information for each respective interaction to a respective destination that relates to the microservices determined in step S408. In an exemplary embodiment, for any given interaction, there may be more than one suitable route and more than one suitable destination, depending on the microservices to be used, and also depending on the order of using the microservices. As a result, the interaction services routing and handling module 302 may determine two or more suitable routes and/or two or more suitable destinations for a particular interaction. Then, at step S412, the interaction services routing and. handling module 302 uses a metric that relates to workload distribution for selecting an optimum route; and at step S414, the interaction services routing and handling module 302 uses the optimum route for routing the information.

FIG. 7 is a diagram 700 that illustrates a plurality of microservices and corresponding routing paths for implementing a method for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results, according to an exemplary embodiment. As illustrated in FIG. 7, a large number of microservices may be available for handling a particular request with respect to an interaction, including microservices having the following descriptors: “resource state”; “attribution”; “event listener”; “auditor”; “warm channel transfer”; “qualification”; “resource assign”; “event processor”; “monitor”; “flow processor”; “channel adapters”; “rules processor”; “get customer journey”; “specialist login”; “get specialist profile”; “get contacts”; “get communication history”; “receive voice & video call”; “invoke automated chat”; “invoke social”; “auditor”; “invoke simple chat”; “invoke conversation (multimedia)”; set disposition”; and “get customer journey”.

Further, as also illustrated in FIG. 7 and in accordance with an exemplary embodiment, the microservices may be depicted in a honeycomb-type hexagonal pattern. In this manner, the analyzing of a particular interaction effectively breaks up the associated tasks into relatively small pieces that correspond to different microservices. In an exemplary embodiment, a cloud native microservices-based implementation, such as Kafka, is used, and in this construct, the honeycombs communicate with one other via events. The use of such an implementation provides several advantages, including the following: 1) Events must arrive in the proper order and must be scalable. 2) By partitioning the interactions, there is a low latency with respect to increasing or decreasing the number of microservices to be used (further noting that lower processing latency may be achieved by increasing the number of microservice instances). 3) By virtue of the ordering and the scalability of events, the interaction services handling module 302 achieves a higher throughput, thereby speeding up processing. 4) Load balancing and caching of IP addresses also contributes to higher processing speeds. 5) The ability to identify multiple redundancies in connections between microservices provides system resiliency and robustness. In an exemplary embodiment, events relating to a specific user session must be consumed in exactly the same order as the events were produced. Events relating to multiple user sessions need not be consumed, relative to each other, in the order in which they were produced. Distinguishing between events relating to a specific user session and events relating to multiple user sessions in this manner may facilitate a greater parallel processing capacity.

At step S416, the interaction services routing and handling module 302 receives response information that relates to a respective response for each corresponding request. In this aspect, in many situations, the received response effectively concludes the interaction.

In an exemplary embodiment, a cloud native microservice approach for an omni-channel contact center is provided. This approach includes decomposed contract bases microservices and a microservices-based event-driven architecture that resides in the cloud and is designed to have an elastic scale, high availability, and high resiliency, with a service level agreement (SLA) that is higher than 99.999%. The contact center is a real time (millisecond, sub-second latency) architecture that has an extensive intrinsic design. Groups of microservices are created in order to provide different aspects of functionality. The stack includes a platform as a service (i.e., microservices platform, such as, for example, Kubernetes or Cloud Foundry), Kafka scalable event messaging and streaming technology, Cassandra, NoSQL performant private database for microservices, and distributed in-memory grid technologies such as, for example, Cloud Cache, for storing quickly accessible state information.

The general architecture includes a facade layer of microservices adapting to external vendor elements through predetermined protocols, and normalizing the communication to fit a highly available, concurrent processing, resilient, large-scale, event-based communication; Kafka Topics for ordered events to consuming instances of microservices; client-facing microservices which consume raw Kafka events from façade microservices and provide discrete functional services with a client-facing application programming interface (API)—RESTful Web Services; a general purpose notification service that provides a bidirectional low latency event exchange mechanism between clients (e.g., single user web clients) or server applications (e.g., fraud ecosystems, voice biometric systems, analytics, and/or recording systems); web clients following microservices architecture with user interface (UI), software development kit (SDK), and Services architecture using Angular8 frameworks; drop-in concept for specialist phone control applications into various servicing applications delivering a computer telephony integration (CTI) container with all of the functionality included therein; programmatic APIs for screen pop; and standalone ribbon. Clusters of microservices are provided for core servicing fabric telephony and agent login; automated specialist provisioning across multiple vendor solutions for orchestration, routing, recording, voicemail, and other functionalities; specialist phone control; and real-time dashboard for contact center supervisory personnel.

In another exemplary embodiment, a client ribbon embedding mechanism that is suitable for a large scale deployment and integration with key value pairs (KVPs) for screen pops is provided. The client ribbon embedding mechanism includes a self-contained feature set that is extensible to omni-channel without requiring extensive deployment and knowledge of CTI protocols and APIs by non-contact center developers. The mechanism creates a lightweight approach to integrating contact center specialist features into the servicing application, thereby providing a quicker rollout, reduced integration effort, and automatic updates for easier maintenance. The mechanism includes standardized integration patterns and a cookbook recipe approach, and provides a way to obtain integrated features required by servicing applications. These features may include: screen pops; updating customer relevant data; end call tracking; state change tied to case disposition; transfer and conference events; customized call notifications; and enabling key value observers (KVOs) to be updated by servicing applications, middleware, and fraud authentication systems.

In yet another exemplary embodiment, a Kafka usage for converting stateful ordered events to stateless, scalable eventing in real time is provided. The design includes concurrent data-center (DC) and pool-specific active and backup topics on multiple Kafka clusters in order to handle catastrophic pool failures. In an exemplary embodiment, a pool refers to an instance of the cloud platform so that multiple pools within a DC provide resiliency in the event of a failure of a single pool (e.g., a bad network router). Other features include cross-DC Kafka events to provide a telephony service that is abstracted from an affinity to one of many DC's. The use of a Kafka routing key that is tied to directory numbers (DNs) and design in partitioning may also be provided, in order to cause ordered events to go to particular consumers in a scalable manner. A sticky Kafka partition assignor to reduce latencies when the cloud system automatically scales up or down may also be provided, for overcoming a need to rebalance and/or resend on multiple hops that may otherwise introduce latencies. A sequential thread executor may also be provided to distinguish between events that may be processed in parallel from those that must be processed sequentially.

The Kafka usage may include a sticky pool-aware Kafka partition assignor to enable a cloud system to automatically scale up or down despite pool affinities, which require each message to be processed by an instance within that pool that would otherwise fail or be inefficient outside of that pool. The sticky pool-aware Kafka partition assignor is designed to minimize churn while allowing an application to reserve a partition in order to avoid any impact while scaling up. The sticky pool-aware Kafka partition assignor may also cause partitions to stick to respective pools so that affinities to each pool are unaffected during rebalancing.

The Kafka usage may also provide for handling affinities at the edge of the cloud where only one instance can process a particular message but Kafka has only crude routing capabilities. In this aspect, an application instance with an affinity, such as, for example, a web-socket to a specific client, supplies the client with a subscriptionId that happens to also be a Kafka routing key that guarantees that all messages sent to that client from back end services arrive, within a single hop, at the correct application instance. The application had previously reserved a partition, calculated as at least one universally unique identifier (UUID) that routes to the partition, so that the UUID(s) can be offered on demand to clients as subscription IDs.

The Kafka usage may also provide for multi-threading of the consumption of messages per Kafka partition while maintaining strict message ordering. In this aspect, for the vast majority of application, ordering only has meaning for messages produced with the same routing-key. Thus, the Kafka usage may be designed to process all messages received from a partition in parallel except for those messages with the same key which must be processed sequentially.

In still another exemplary embodiment, resiliency patterns and a client discovery service designed to overcome global load balancer (GLB) latencies is provided. Browsers and client desktops cache domain name system (DNS) resolution of uniform resource locators (URLs), and when the backend services or pools experience failures, the clients continue to attempt to generate requests to the same defunct destination. In such deployments, where no performant IP sprayers or gateways exist and where millisecond latency SLAs exit, there may be a disruption in the continuous availability of services. In this aspect, a client side resiliency that complements the multi-pool, multi-instance, and multi-data center availability for instant seamless connection is provided. The client first discovers services and capabilities, including backup pool URLs, according to current availability and user authorization. The discovery service provides intelligent backup URLs for stateful services, stateless services, and external server systems. A client software development kit abstracts the resiliency, rehydration, and reconnection logic, begins network recovery, and then does a seamless login. The client user interface automatically recovers from the loss of a websocket or failure of a cloud microservice in a pool.

In yet another exemplary embodiment, resiliency patterns and seamless resiliency of stateful, low latency telephony clients across multiple data centers (DCs). In each data center, stateful edge services monitor each extension (i.e., domain name) simultaneously from different instances on both pools, thereby providing both instance and pool resiliency. Such services may use a de-duper that receives events from both pools but propagates only one pool. For phone resiliency, extension (domain name) may move from one data center to another, and the servicing fabric in both data centers may detect the move and direct requests to the new data center. Failure to login causes a resynchronization of the phone state in both data centers, thus self-healing in case discovery becomes out of synchronization.

The following table provides a list of features and specific aspects thereof:

Stateful Domain Stateful −> Stateless Bidirectional Dealing with Follow the WebSocket Vendor Egress Phone - DR High Affinity failover connections Low Latency Minimize Select Blazing Highly concurrent Custom Sticky Latencies through Fast Technologies connections: Kafka Partition colocation vendor systems & Assignor clients Stack HA Provide High Leverage nascent Event Starters Standby Data Availability resiliency in stack encapsulate High Center (DC) (HA) of CaaS. Availability (HA) Promotion Kafka clusters under the cover Load Balancing Circuit Breaker Connection to Phone and queue Data extractions Patterns: for Global Load monitoring load load balanced end-user client and Balancers (GLBs) balanced across a across Data server-to-server for non-cloud DC Centers (DCs) (API2API) servers invocations, with backup Availability Zones Black Availability Client Side Kafka moves all Subscriptions SDK connects to Zone Failure Recovery (Web load to other replicated across other Availability Socket disconnect, Availability Zone Availability Zones Zone Availability Zone in less than 3 sec failure, app failure) Grey Availability AZ aware Sticky Multiple layers of OAUTH2 Cloud Config Zone Failure Partition Assignor defense for grey Authorization Server has all the isolates network failures across multiple bootstrap info, issues in Availability Zone Prod: Bitbucket Availability Zones environment

In still another exemplary embodiment, defense mechanisms for handling grey failures in the cloud are provided. A first defense mechanism is a sticky partitioner that is designed to handle a scenario in which one pool is bad, and even while sharing the same Kafka and Cassandra across two pools, events would zigzag across applications in the two pool, thereby increasing the probability of a grey failure when any microservice in a second pool begins to go bad, and also affecting all traffic. The sticky partitioner addresses this scenario by isolating network issues in pools by primarily routing the events to the same pool, thereby ensuring that 50% of the traffic is not affected by an unhealthy grey pool.

A second defense mechanism is the use of multiple levels of defense for grey failures so that a single failure does not equate to a request failure as it is retried across other pools and/or other mechanisms. For example, for a scenario in which an external server application issues a request to a pool that is only partially able to service the request, thereby resulting in a failure, this defense mechanism is designed to propagate all information available for servicing the request in a second attempt on another pool. If the second pool is able to find the remaining missing data from the first pool, then the second pool processes the request.

A third defense mechanism is the use of multiple layers of defense for grey failures for stateful applications so that a single failure does not equate to a request failure as there are multiple resiliency designs at each stage of the microservice in order to ensure servicing the request. For example, for a scenario in which a ribbon login fails because a CTI extension monitoring had failed or was interrupted, or because the request was routed to the wrong pool, or because the domain name is not in service, this defense mechanism is designed to perform several functions, including the following: CTI monitors domain name changes at all times; domain name in-service and out-of-service events are propagated across both data centers; if the login attempt comes to a data center where the domain name is out of service, CTI will ask the other data center's CTI to publish if the domain name is in service in that data center; repeat a set up from scratch for failed connections for some CTI domain names; delegate some failed connections for some CTI domain names from one CTI to a backup CTI; and recovery code in ribbon client to go into retry mode and determine when the domain name status changes, thereby self-healing.

In yet another exemplary embodiment, high efficiency reliable bidirectional messaging for low latency applications is provided. This embodiment includes several features. A first feature is an ability to send a Kafka event direct to the instance hosting the web-socket for the final leg of delivery with a minimum possible latency. This is achieved by calculating a UUID that maps to a partition owned by the notification-service instance so that all messages sent using that UUID as a Kafka routing key are delivered directly to the correct one of many notification-service instances.

A second feature is an ability to scale up a number of instances without any latency nor disruption to existing web-socket users. This is achieved by using a custom stick partition assignor whereby the consumer is guaranteed that one partition is never removed. This also avoids two-hop routing.

A third feature is load balancing of system-wide events to another ecosystem through stateless, load balanced, randomized delivery on any of the web-sockets (WS). This feature provides an ability to load-balance events that can be consumed by a group of web-socket clients. This is achieved by allowing each member of a load-balancing (LB) group to subscribe with the name of the LB group so that future messages received by a notification service on a UUID that belongs to the group can be delivered to any member.

A fourth feature allows for more than one web-socket to be part of a high availability (HA) group to ensure low latency and guaranteed delivery on a surviving web-socket. This feature provides an ability to support clients that require a highly available pair of web-sockets where ordered events are delivered via an “active web-socket” only, and when it fails, the surviving web-socket is immediately promoted to being active. Thus, a latency that would have occurred without the HA group is completely avoided. Meanwhile, the client will initiate a new backup web-socket. To protect against failure or down-scaling, upon receiving a new web-socket request with an HA group identification, the corresponding notification service will reject a request to create a second web-socket in the same HA group on the same instance.

A fifth feature provides an ability to support message delivery from clients in multiple pools. This is achieved by using Kafka's native ability to route messages using a routing key so that the producer of the message only needs to know the Kafka cluster address.

A sixth feature provides an ability to subscribe anywhere, replicate everywhere, and notify anywhere. This feature further provides an ability to support message delivery from clients in multiple data centers (DCs) whereby when a message is received in one DC where the UUID is not recognized, the notification service will query a database to determine the Kafka cluster associated with the UUID so that the message is delivered in a second hop. In this manner, the client need not be concerned with the DC affinity of the web-socket.

A seventh feature provides an ability to act as a durable message provider by which no messages are lost. This feature further provides an ability to cache events in case a client is temporarily absent, providing a fire and forget service for microservices. This is achieved by caching undeliverable events for a configurable amount of time after a web-socket disconnects. On reconnection, the client will present, via a web-socket message, an identifier that maps it to the previously used UUID, and the notification service will then deliver all cached messages before continuing with normal message delivery.

An eighth feature provides a client side home pool, which allows clients to receive events more quickly by directing them to a more efficient pool. The efficiency is improved through locality, speedier delivery of events for co-located microservices, and Kafka, together with vendor gear for a particular user.

A ninth feature provides a common utility framework to notify any client independent of any type of microservices (i.e., a sender of an event). The common utility framework manages the client notification channel and is a common utility for services, thus abstracting them from the delivery details.

A tenth feature provides client session management via termination lifecycle events, which are being sent to all microservices. An eleventh feature provides abstracting of the Kafka resiliency architecture (e.g., dual DC or standby DC) via a mere web-socket delivery.

Taken together, these features provide additional advantages, including the following: First, ribbon clients were preferred not to talk to Kafka because it would require a partition for each user, but an excessive number of partitions would not be supported by Kafka, because of a lack of scalability, or else users would receive events that were intended for other users. Second, web-sockets are used for low latency, but the present embodiment uses a common web-socket towards a client, and routes all events from various microservices on the same channel.

FIG. 8 is a flowchart 800 of a method for processing a message that is implemented on a consumer side of Kafka Messaging platform, according to an exemplary embodiment.

Algorithm for Consumer Affinity: In a system where a Kafka message can only be processed by one of many consumers, the state of the art is to either: 1) accept that messages with a routing key may arrive at the wrong instance and correct that using two hop routing together with a cache of “key-to-instance” and “instance-to-partition” mappings; or 2) for the message Producer to co-operate with the Consumer by producing the message to a particular partition that, the Producer knows is owned by the target Consumer instance. This, however, couples Producer and Consumer and requires communication to handle setup and rebalancing. Use of Kafka is discouraged where this requirement exists.

Referring to FIG. 8, in an exemplary embodiment, the present disclosure provides a mechanism to solve the problem in the Consumer while maintaining loose or no coupling between Producer and Consumer, as follows: 1) On startup, the Kafka Consumer registers with a sticky partitions assignor (operation S802) and acquires 1:n partitions (operation S804), 2) Consumer identifies one of the n partitions, e.g., the lowest, to be its sticky partition (operation S806). 3) Consumer generates a store of routing keys (operation S808) that are known to route to the sticky partition by creating random keys and either a) apply Kafka's hash+mod algorithm and discard those keys which do not map to the sticky partition, or b) produce the keys to the “inbound” topic and on consumption, store keys from the sticky partition. 4) Consumer receives a subscription for a service supplied by the consumer via any mechanism (e.g., REST, Kafka etc). The service returns an unused routing key from its store as a subscription-identifier (operation S810). 5) The client, on receiving a subscription response with a subscription-identifier, subscribes to other services using the same identifier (operation S812). 6) When the other services wish to send a message to their client, they send each Kafka message using the client's identifier as the routing key (operation S814). The message will now route directly to the one-and-only consumer capable of processing that message.

In one exemplary embodiment, assignor of step-1 is Kafka's standard sticky partition assignor which reduces the probability that the partition is moved during rebalancing. In the case where the partition is removed due to rebalancing, two hop routing is required together with a cache of ‘key-to-instance’ and ‘instance-to-partition’ mappings.

In another exemplary embodiment, a customized Kafka partition assignor algorithm is used to guarantee that in the event of rebalancing (i.e., where the number of consumers increases or decreases), the sticky partition is never removed from the consumer that initially acquired it, for as long as that consumer remains healthy.

On Kafka rebalancing, when a consumer-instance has acquired its first set of partitions, the consumer-instance chooses one as its “hard sticky partition.” On every subsequent rebalance: 1) the consumer is queried for metadata that will be supplied to the lead assignor and returns either only the hard-sticky partition or all existing partitions with a weighting for each partition, the hard-sticky being the most sticky; 2) on receipt of the set of metadata from all instances of the consumer-group, the lead assignor reads the hard-sticky partition from every instance and allocates it back to its owner. It then allocates the remaining partitions using the supplied weightings if any or using any other algorithm such as “sticky” or “round-robin”; 3) the lead assignor returns the assignment decisions which are distributed to consumers using the existing mechanism; and 4) consumers receive their new assignment which includes the hard-sticky partition.

FIG. 9 is a flowchart 900 of a method for processing a message that is implemented on a producer side of Kafka messaging platform, according to an exemplary embodiment.

Algorithm for Producer Affinity: In a system where a Producer obtains its events from a non-reliable event source and/or an event source that is not capable of load-balancing its notification of events among a group of clients, and/or an event source that can only process requests at the instance where the subscription was made, the state of the art is for the Producer to do the following: 1) Use an algorithm to evenly distribute all subscriptions across all Producer instances in each Availability Zone (AZ). Every subscription is therefore copied in two or more Availability Zones, with one as Primary AZ. Each subscription is for one of many “categories” support by the non-reliable event source. A phone number is an example of a resource-identifier. 2) Persist the instance-to-subscription mappings in a cache that is available to all other instances. 3) Re-route requests in a second hop to an instance that has a subscription for the resource-identifier using the cache. 4) Backup subscriber to detect failure of the primary producer and take over message production as Primary.

Referring to FIG. 9, in an exemplary embodiment, the present disclosure provides a solution that avoids latency in two-hop routing of requests and avoids the need for a complex detection and recovery mechanism when a Primary Producer fails or loses connectivity to an event source, as follows: 1) On startup, consume from the external facing “request” topic and the application's internal “local AZ” topic using a sticky partition assignor and the same consumer-group in all Availability Zones (operation S902). 2) Produce one subscription message per resource-identifier using the resource-identifier name as Kafka routing key to the external facing “request” topic (operations S904 and S906). 3) On consuming a subscription message from the external facing “request” topic (operation S908), a) subscribe to the event source for the specified resource-identifier (operations S910 and S912), b) produce the same subscription message to remote AZ topic(s) (operation S914), and c) persist the Primary mapping of resource-identifier to “request” topic partition index (operation S916). 4) On consuming a subscription message from the application's internal “local AZ” topic (operation S908), a) subscribe to the event source for the specified resource-identifier (operations S910 and S912), and b) persist the Backup mapping of resource-identifier to “local AZ” topic partition index (operation S916). 5) On consuming a request from the external facing “request” topic (operation S918), the application will process the request by propagating the request to the event source (operation S920). 6) On receiving an event from the event source (operation S922), a) the primary caches the message containing details of the event with role:primary (operation S924) and produces it to the output topic (operation S926), and b) the backup produces an equivalent message but to the input “request” topic with metadata role:backup. 7) On consuming a message from the external facing “request” topic with metadata role:backup (operation S928), the primary instance for the routing key uses its cache to validate that it has already produced the equivalent message and if so, deletes the message from the cache (operation S930). If validation fails and connectivity to the event source is known to be lost, then the message is propagated to the output topic. Otherwise, the message is cached and the key is added to a list of keys requiring audit. 8) One or more threads are dedicated to audit out-of-sync keys. On finding a key that has a cached message from a backup source but no messages from the primary, then if the backup message is older than t milliseconds, a) the backup message is produced to the “output” topic with metadata role:backup and deleted, and b) the primary event source is marked as “down” so that the next messages from the backup will be propagated immediately to the output topic.

In another exemplary embodiment, in order to offload some the de-duplication processing, a dedicated deduping application may be used to detect failure of the primary. The deduping application is configured to consume from both the output topic and the backup topic.

In Step 6, on receiving an event from the event source, the primary produces to the output topic a message containing details of the event and the backup produces an equivalent message, but to a “backup” topic.

In Step 7, the de-dupe application consumes all messages originating from primary producers from the “output” topic and all messages originating from backup producers from the “backup” topic. If the equivalent message is already cached, then the cached message is deleted. If not, then the message is cached with timestamp and the de-dupe key is flagged for audit as in Step 8.

In another exemplary embodiment, in order to guarantee 100% de-duplication at a cost of increased latency in normal operation, both primary and backup instances of computer telephony integration (CTI) produce to the same “dupes” topic in order to guarantee the following:

In Step 6, on receiving an event from the event source, the de-dupe application produces to output topic “dupes” a message containing details of the event with metadata role:primary or role:backup according to whether the instance is Primary or Backkup for the given resource-identifier.

In Step 7, the de-dupe application consumes all messages originating from both primary producers and backup producers from the “backup” topic. If a message originates from the primary, then it is immediately propagated to the output topic and the cache is updated (i.e., message is added to the cache if equivalent from backup is not found, or if found then the backup message is deleted). If the message originates from a backup, and the equivalent message from the primary is already cached, then the cached message is deleted. If not, then the message is cached with timestamp and the de-dupe key is flagged for audit as in Step 8.

FIG. 10 is a flowchart 1000 of a method for minimizing latency while maintaining order and scale on Kafka messaging platform, according to an exemplary embodiment.

Algorithm for minimizing latency while maintaining ordering and scale: In a system involving many users, the ordered list of messages related to a particular user must be maintained. The simple solution of creating one topic per user is 1) not scalable because it would consume too many resources from the Kafka cluster; and 2) difficult for consumers to manage because consumers must learn about new users and implement their own algorithm to load balance.

In an exemplary embodiment, users are the unit of parallelism but the algorithm can be applied to any system containing multiple units of parallelism.

A general system of Producers and Consumers involves multiple Producers producing events to a topic and multiple Consumers load-balancing the consumption of these messages. There can be no inherent ordering between messages produced by Producer instance-1 versus instance-2 because they originate from different computers and the production is not synchronized. Further, there is no inherent ordering between most of the messages produced by any one instance of the Producer because although strict ordering is required for the set messages related to an individual user, strict ordering at the consumer is not required for the larger set of messages concerning all the users managed by the Producer.

In real time, Producer-1 producers messages in exactly the order that they occurred: {M1-U1, M2-U2, M3-U1, M4-U2} where M1-U1 is Message1-User1.

Given that a user is the unit of parallelism, the consumer must consume M1-U1 before M3-U1 and M2-U2 before M4-U2, but it does not matter if the consumer consumes and processes M4-U2 before or after M3-U1.

Referring to FIG. 10, according to an exemplary embodiment, this fact can be leveraged to achieve optimal parallel processing of all messages in the set with multiple users, in accordance with the following: 1) Producers send messages with a routing key that is unique per user (operation S1002). This causes Kafka to route messages from the same key to the same topic-partition (operation S1004 and S1006). For example, M1-U1 and M3-U1 may be produced using “U1” as the router key, and Kafka will route both messages to the same partition p1 of the N partitions in the topic. Similarly, M2-U2 and M4-U2 are routed to p2. 2) Kafka Consumers always consume from one or more topic-partitions and a topic-partition is never allowed by be consumed by more than one consumer instance in the same consumer group at the same time. Therefore, unless rebalancing occurs, the same consumer instance is guaranteed to consume all messages produced with the same key: 3) Whereas the state of the art is to consume all messages from a given topic-partition in the same thread, thus preserving the ordering of all messages on the partition, in an exemplary embodiment, messages with different routing keys are processed in parallel by multiple threads and messages with the same routing key are processed sequentially, in the order that they arrived.

This is achieved by using an enhanced executor that takes both the task to be executed and the sequence-identifier(e.g., the Kafka routing key) and returns a Callback (Future). The executor is backed by a pool of threads which may originate from a standard executor or be managed as worker threads belong directly to the executor. Referring again to FIG. 10, on receiving a command to execute a task with a key (operation S1008), the executor uses the client thread to do each of the following: 1) acquire the “per-key-queue-map” lock (operation S1010); 2) attempt to get an existing “per-key-queue” from a singleton “per-key-queue-map” of keys to “per-key-queue” (operation S1012); 2a) if found, then acquire the existing “per-key-queue-map” lock, add the task is to the “per-key-queue” (operation S1014), and release the “per-key-queue-map” lock (operation S1016); 2b) if not found, then create and add the task to a new, “per-key-queue” (operations S1012 and S1014) and finally add the “per-key-queue” as a task to the main-queue for execution by a worker thread; and 3) release the “per-key-queue-map” lock (operation S1016).

When a worker thread is notified of a new “per-key-queue,” the worker thread will perform each of the following: 1) acquire the “per-key-queue-map” lock; 2) compete to remove the “per-key-queue” from the main-queue; 3) release the “per-key-queue-map” lock; 4) execute the first task; 5) acquire the “per-key-queue-map” lock; 6) remove the completed task from the “per-key-queue” and get the next task; 7) release the “per-key-queue-map” lock; 8) execute the next task and on completion repeat the last three steps for every other task; and 9) on finding no more tasks to execute: a) acquire the “per-key-queue-map” lock; b) remove the “per-key-queue” from the “per-key-queue-map” if still empty; and c) release the “per-key-queue-map” lock.

In another exemplary embodiment, when higher throughput is required, the client thread drops off the message into a “task-queue” and the worker threads compete to remove the task from the “task-queue.” On finding that the “per-key-queue” already exists in the “per-key-queue-map,” the worker thread adds the task to the queue and is available for other work. If not, the worker thread adds the “per-key-queue” to the “per-key-queue-map” and begins execution.

In another exemplary embodiment, the executor provides a mechanism by which a batch of tasks can be executed and the client can register a callback for notification of when 0:n messages remain unprocessed within the batch. This is useful to a Kafka consumer who, upon receiving a batch of messages, wants to either: 1) receive one callback that every message in the entire batch has been executed so that all topic-partitions within the batch can be acknowledged as having been processed; 2) receive one callback that all but n messages have been processed so that the next batch can begin without incurring latency while optimistically acknowledging all messages in the expectation that the remaining n−1 messages will be processed without failure of the application; or 3) where the batch of Kafka messages from many topic-partitions are broken into sub-batches of individual top-partitions so that each topic-partition can be acknowledged separately so that failure of the application will not cause a replay of those already-completed messages.

Accordingly, with this technology, an optimized process for handling large number of customer service interactions to ensure efficient and accurate interaction servicing results is provided.

Although the invention has been described with reference to several exemplary embodiments, it is understood that the words that have been used are words of description and illustration, rather than words of limitation. Changes may be made within the purview of the appended claims, as presently stated and as amended, without departing from the scope and spirit of the present disclosure in its aspects. Although the invention has been described with reference to particular means, materials and embodiments, the invention is not intended to be limited to the particulars disclosed; rather the invention extends to all functionally equivalent structures, methods, and uses such as are within the scope of the appended claims.

For example, while the computer-readable medium may be described as a single medium, the term “computer-readable medium” includes a single medium or multiple media, such as a centralized or distributed database, and/or associated caches and servers that store one or more sets of instructions. The term “computer-readable medium” shall also include any medium that is capable of storing, encoding or carrying a set of instructions for execution by a processor or that cause a computer system to perform any one or more of the embodiments disclosed herein.

The computer-readable medium may comprise a non-transitory computer-readable medium or media and/or comprise a transitory computer-readable medium or media. In a particular non-limiting, exemplary embodiment, the computer-readable medium can include a solid-state memory such as a memory card or other package that houses one or more non-volatile read-only memories. Further, the computer-readable medium can be a random-access memory or other volatile re-writable memory. Additionally, the computer-readable medium can include a magneto-optical or optical medium, such as a disk or tapes or other storage device to capture carrier wave signals such as a signal communicated over a transmission medium. Accordingly, the disclosure is considered to include any computer-readable medium or other equivalents and successor media, in which data or instructions may be stored.

Although the present application describes specific embodiments which may be implemented as computer programs or code segments in computer-readable media, it is to be understood that dedicated hardware implementations, such as application specific integrated circuits, programmable logic arrays and other hardware devices, can be constructed to implement one or more of the embodiments described herein. Applications that may include the various embodiments set forth herein may broadly include a variety of electronic and computer systems. Accordingly, the present application may encompass software, firmware, and hardware implementations, or combinations thereof. Nothing in the present application should be interpreted as being implemented or implementable solely with software and not hardware.

Although the present specification describes components and functions that may be implemented in particular embodiments with reference to particular standards and protocols, the disclosure is not limited to such standards and protocols. Such standards are periodically superseded by faster or more efficient equivalents having essentially the same functions. Accordingly, replacement standards and protocols having the same or similar functions are considered equivalents thereof.

The illustrations of the embodiments described herein are intended to provide a general understanding of the various embodiments. The illustrations are not intended to serve as a complete description of all the elements and features of apparatus and systems that utilize the structures or methods described herein. Many other embodiments may be apparent to those of skill in the art upon reviewing the disclosure. Other embodiments may be utilized and derived from the disclosure, such that structural and logical substitutions and changes may be made without departing from the scope of the disclosure. Additionally, the illustrations are merely representational and may not be drawn to scale. Certain proportions within the illustrations may be exaggerated, while other proportions may be minimized. Accordingly, the disclosure and the figures are to be regarded as illustrative rather than restrictive.

One or more embodiments of the disclosure may be referred to herein, individually and/or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any particular invention or inventive concept. Moreover, although specific embodiments have been illustrated and described herein, it should be appreciated that any subsequent arrangement designed to achieve the same or similar purpose may be substituted for the specific embodiments shown. This disclosure is intended to cover any and all subsequent adaptations or variations of various embodiments. Combinations of the above embodiments, and other embodiments not specifically described herein, will be apparent to those of skill in the art upon reviewing the description.

The Abstract of the Disclosure is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, various features may be grouped together or described in a single embodiment for the purpose of streamlining the disclosure. This disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter may be directed to less than all of the features of any of the disclosed embodiments. Thus, the following claims are incorporated into the Detailed Description, with each claim standing on its own as defining separately claimed subject matter.

The above disclosed subject matter is to be considered illustrative, and not restrictive, and the appended claims are intended to cover all such modifications, enhancements, and other embodiments which fall within the true spirit and scope of the present disclosure. Thus, to the maximum extent allowed by law, the scope of the present disclosure is to be determined by the broadest permissible interpretation of the following claims, and their equivalents, and shall not be restricted or limited by the foregoing detailed description. 

What is claimed is:
 1. A method for processing a message on a messaging platform, the method being implemented by at least one processor, the method comprising: acquiring, by the at least one processor, a plurality of partitions from the messaging platform; designating, by the at least one processor, a first partition from among the plurality of partitions as a sticky partition; generating, by the at least one processor, a plurality of routing keys that are configured to route messages to the sticky partition; using, by the at least one processor, a first routing key from among the plurality of routing keys for a first service subscription; processing, by the at least one processor, the first service subscription and returning the first routing key as a first subscription identifier; removing, by the at least one processor, the first routing key from the plurality of routing keys for a subsequent service subscription; and receiving, by the at least one processor, a message transmitted by a second service using the first subscription identifier as a routing key.
 2. The method of claim 1, wherein the messaging platform includes a Kafka messaging platform.
 3. The method of claim 2, further comprising: using a custom Kafka sticky partition assignor to acquire a first plurality of metadata that relates to sticky partition preferences; and determining, for each of the first plurality of metadata, a respective highest priority partition for which a corresponding assignment does not change.
 4. A method for processing a message on a Kafka messaging platform, the method being implemented by at least one processor, the method comprising: acquiring, by the at least one processor, a first plurality of subscription requests from an external facing request topic and a second plurality of subscription requests from an internal local availability zone topic; determining, by the at least one processor for each of the first plurality of subscription requests and for each of the second plurality of subscription requests, a respective resource-identifier; and generating, by the at least one processor for each respective resource-identifier, a corresponding subscription message.
 5. The method of claim 4, wherein when a first subscription message from the external facing request topic is consumed, the method further comprises: determining, by the at least one processor, a first resource-identifier that corresponds to the first subscription message; subscribing, by the at least one processor, to a first event source that corresponds to the first resource-identifier; transmitting, by the at least one processor, the first subscription message to at least one remote availability zone; and persisting, by the at least one processor, a primary mapping of the first resource-identifier to a request topic partition index.
 6. The method of claim 4, wherein when a second subscription message from the internal availability zone topic is consumed, the method further comprises: determining, by the at least one processor, the first resource-identifier that corresponds to the second subscription message; subscribing, by the at least one processor, to the first event source that corresponds to the first resource-identifier; and persisting, by the at least one processor, a backup mapping of the first resource-identifier to a local availability zone topic partition index.
 7. The method of claim 4, wherein when a first request from the external facing request topic is consumed, the method further comprises processing the first request by propagating the first request to an event source at which a subscription has already been established.
 8. The method of claim 7, wherein when an event is received from the event source, the method further comprises: determining that the event is from a primary mapping, and transmitting the corresponding subscription message to an output topic; when an equivalent message from a backup mapping has been previously cached, deleting the equivalent message from the cache; and when an equivalent message from a backup mapping has not been previously cached, caching the event with at least one detail relating to the backup mapping.
 9. The method of claim 7, wherein when an event is received from the event source, the method further comprises: determining that the event is from a backup mapping; and transmitting the corresponding subscription message to a request topic.
 10. The method of claim 9, wherein when a subsequent message is received from the request topic, the method further comprises: when an equivalent message from a primary mapping has been previously cached, deleting the equivalent message from the cache; and when an equivalent message from a primary mapping has not been previously cached, caching the event with at least one detail relating to the backup mapping.
 11. A method for minimizing latency on a Kafka messaging platform, the method being implemented by at least one processor, the method comprising: receiving, by the at least one processor, a plurality of messages from a plurality of users on a single topic-partition; using, by the at least one processor, a user identifier that relates to a unique user and a corresponding routing key that is unique to a user in a first message from among the plurality of messages; determining, by the at least one processor, a first subset of the plurality of messages that are executable in parallel and a second subset of the plurality of messages that are processible sequentially in order of receipt; executing, by the at least one processor, the first subset of the plurality of messages in parallel; and processing, by the at least one processor, the second subset of the plurality of messages sequentially in order of receipt using the corresponding routing key.
 12. The method of claim 11, wherein when a command to execute a task with a key is received, the method further comprises: acquiring a per-key-queue-map lock; obtaining an existing per-key-queue from the per-key-queue-map; adding the task to the existing per-key-queue; and releasing the per-key-queue-map lock.
 13. The method of claim 11, wherein when a command to execute a task with a key is received, the method further comprises: acquiring a per-key-queue-map lock; determining that an existing per-key-queue does not exist; generating a new per-key-queue; adding a first task to the new per-key-queue; adding the new per-key-queue to the per-key-queue-map; releasing the per-key-queue-map lock; executing at least one task from among a plurality of tasks in the per-key-queue; and stopping execution when the per-key-queue is empty.
 14. The method of claim 11, wherein when a command to execute a task with a key is received, the method further comprises: receiving a number of tasks to be completed in a batch of tasks; tracking a completion of each task in the batch of tasks; determining uncompleted tasks from among the batch of tasks; and when all tasks in the batch have been completed, sending a notification that the batch has been completed. 